Bounded Independence Plus Noise Fools Products
نویسندگان
چکیده
منابع مشابه
Bounded Independence Plus Noise Fools Products
Let D be a b-wise independent distribution over {0, 1}m. Let E be the “noise” distribution over {0, 1}m where the bits are independent and each bit is 1 with probability η/2. We study which tests f : {0, 1}m → [−1, 1] are ε-fooled by D + E, i.e., |E[f(D+E)]−E[f(U)]| ≤ ε where U is the uniform distribution. We show that D+E ε-fools product tests f : ({0, 1}n)k → [−1, 1] given by the product of k...
متن کاملMore on bounded independence plus noise: Pseudorandom generators for read-once polynomials
We construct pseudorandom generators with improved seed length for several classes of tests. First we consider the class of read-once polynomials over GF(2) in m variables. For error ε we obtain seed length Õ(log(m/ε)) log(1/ε), where Õ hides lower-order terms. This is optimal up to the factor Õ(log(1/ε)). The previous best seed length was polylogarithmic in m and 1/ε. Second we consider produc...
متن کاملPoly-logarithmic independence fools AC circuits
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan [LN90]. The only prior progress on the problem was by Bazzi [Baz07, Baz09], who showed that O(logn)-independent distributions fool poly-size DNF formulas. Razborov [Raz08] has later given a much simpler proof for Bazz...
متن کاملBounded Independence vs. Moduli
Let k = k(n) be the largest integer such that there exists a k-wise uniform distribution over {0, 1}n that is supported on the set Sm := {x ∈ {0, 1}n : ∑ i xi ≡ 0 mod m}, where m is any integer. We show that Ω(n/m2 log m) ≤ k ≤ 2n/m+2. For k = O(n/m) we also show that any k-wise uniform distribution puts probability mass at most 1/m+1/100 over Sm. Finally, for any fixed odd m we show that there...
متن کاملLifting independence results in bounded arithmetic
We investigate the problem how to lift the non-8 b 1 ()-conservativ-ity of T 2 2 () over S 2 2 () to the expected non-8 b i ()-conservativity of T i+1 2 () over S i+1 2 (), for i > 1. We give a non-trivial reenement of the "lifting method" developed in 4, 8], and we prove a suucient condition on a 8 b 1 (f)-consequence of T2(f) to yield the non-conservation result. Further we prove that Ramsey'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2018
ISSN: 0097-5397,1095-7111
DOI: 10.1137/17m1129088